Efficiency of random swap clustering
نویسندگان
چکیده
منابع مشابه
To Determine Document Clustering By using Centroid Ratio for Pair wise Random Swap Clustering Algorithm
Clustering algorithm and cluster validity are two highly correlated parts in cluster analysis. In this paper, a novel idea for cluster validity and a clustering algorithm based on the validity index are introduced. A Centroid Ratio is firstly introduced to compare two clustering results. This centroid ratio is then used in prototype-based clustering by introducing a Pair wise Random Swap cluste...
متن کاملSwap-based Clustering for Location-based Services
Clustering is an unsupervised learning method widely used in many fields, such as machine learning, pattern recognition, data mining and image analysis. The goal of this study is to investigate swap-based clustering and its application to location-based services. Swap-based clustering is a local search heuristic trying to find the optimal centroid locations by performing a sequence of centroid ...
متن کاملassessment of the efficiency of s.p.g.c refineries using network dea
data envelopment analysis (dea) is a powerful tool for measuring relative efficiency of organizational units referred to as decision making units (dmus). in most cases dmus have network structures with internal linking activities. traditional dea models, however, consider dmus as black boxes with no regard to their linking activities and therefore do not provide decision makers with the reasons...
Evaluating the efficiency of bank branches with random data
Data Envelopment Analysis (DEA) is a mathematic technique to evaluate the relative efficiency of a group of homogeneous decision making units (DMUs) with multiple inputs and outputs. The efficiency of each unit is measured based on its distance to the production possibility set (PPS). In this paper, the BCC model is used in output-oriented. The average return on profit as output and the covaria...
متن کاملSwap-invariant and exchangeable random sequences and measures
In this work we analyze the concept of swap-invariance, which is a weaker variant of exchangeability. An integrable random vector ξ in R is called swap-invariant if E ∣∣∑ j ujξj ∣∣ is invariant under all permutations of the components of ξ for each u ∈ R. Further a random sequence is swap-invariant if its finite-dimensional distributions are swap-invariant. Two characterizations of large classe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Big Data
سال: 2018
ISSN: 2196-1115
DOI: 10.1186/s40537-018-0122-y